On the Smallest Enclosing Balls

نویسندگان

  • DAIZHAN CHENG
  • XIAOMING HU
  • CLYDE MARTIN
چکیده

In the paper a theoretical analysis is given for the smallest ball that covers a finite number of points p1, p2, · · · , pN ∈ R . Several fundamental properties of the smallest enclosing ball are described and proved. Particularly, it is proved that the k-circumscribing enclosing ball with smallest k is the smallest enclosing ball, which dramatically reduces a possible large number of computations in the higher dimensional case. General formulas are deduced for calculating circumscribing balls. The difficulty of the closed-form description is discussed. Finally, as an application, the problem of finding a common quadratic Lyapunov function for a set of stable matrices is considered.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Smallest Enclosing Disks (balls and Ellipsoids)

A simple randomized algorithm is developed which computes the smallest enclosing disk of a nite set of points in the plane in expected linear time. The algorithm is based on Seidel's recent Linear Programming algorithm, and it can be generalized to computing smallest enclosing balls or ellipsoids of point sets in higher dimensions in a straightforward way. Experimental results of an implementat...

متن کامل

Approximating Smallest Enclosing Balls with Applications to Machine Learning

In this paper, we first survey prior work for computing exactly or approximately the smallest enclosing balls of point or ball sets in Euclidean spaces. We classify previous work into three categories: (1) purely combinatorial, (2) purely numerical, and (3) recent mixed hybrid algorithms based on coresets. We then describe two novel tailored algorithms for computing arbitrary close approximatio...

متن کامل

Easy and Fast Computation of Approximate Smallest Enclosing Balls

Badoiu and Clarkson [1] introduced an extremely simple incremental algorithm which finds the smallest enclosing ball around points with precision in at most O( ) iteration steps. A simplified proof for this quadratic scaling is given. Based on this proof it is shown that the number of steps in fact increases only like O( ). This new bound leads to a new optimal step size of the algorithm. With ...

متن کامل

On the Ball Spanned

The procedure for linear programming in linear time in fixed dimension is extended to solve in linear time certain nonlinear problems. Examples are the problem of finding the smallest ball enclosing n given balls, and the weighted-center problem in fixed dimension.

متن کامل

On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls

We consider the outer approximation problem of finding a minimum radius ball enclosing a given intersection of at most n− 1 balls in R. We show that if the aforementioned intersection has a nonempty interior, then the problem reduces to minimizing a convex quadratic function over the unit simplex. This result is established by using convexity and representation theorems for a class of quadratic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007